Toposes, Monoid Actions, and Universal Coalgebra
نویسندگان
چکیده
منابع مشابه
The category of monoid actions in Cpo
In this paper, some categorical properties of the category ${bf Cpo}_{{bf Act}text{-}S}$ of all {cpo $S$-acts}, cpo's equipped with actions of a monoid $S$ on them, and strict continuous action-preserving maps between them is considered. In particular, we describe products and coproducts in this category, and consider monomorphisms and epimorphisms. Also, we show that the forgetful functor from...
متن کاملUniversal Dialgebra: Unifying Universal Algebra and Coalgebra
The concept of dialgebra provides a platform under which universal algebra and coalgebra are unified in one theory. Other examples of dialgebras include universal multialgebras and partial algebras. In the dialgebraic setting, several relationships between common features of these various theories are clarified and, in many cases, rather similar proofs of closely related results are combined to...
متن کاملThe Monoid of Queue Actions
Wemodel the behavior of a fifo-queue as a monoid of transformations that are induced by sequences of writing and reading. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic algebraic properties such as conjugacy. Moreover, we show that while several properties concerning its rational subsets are undecidable, their uniform membership prob...
متن کاملRelative Invariance for Monoid Actions
Let S be a topological monoid acting on the topological space M . Let J be a subset of M . Our purpose here is to study the subsets of M which correspond, under the action of S, to the relative (with respect to J) invariant control sets for control systems (see [4] section 3.3). The relation x ∼ y if y ∈ cl(Sx) and x ∈ cl(Sy) is an equivalence relation and the classes with respect to this relat...
متن کاملAnd... Action! - Monoid Actions and (Pre)orders
Orders occur naturally in many areas of computer science and mathematics. In several cases it is very simple do describe an order mathematically, but it may be cumbersome to implement in some programming language. On the other hand many order relations are defined in terms of an existential quantification. We provide a simple abstraction of such definitions using the well-known concept of monoi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1986
ISSN: 0002-9939
DOI: 10.2307/2045722